Heuristic optimisation

نویسندگان

  • Uwe Aickelin
  • Alistair R. Clark
چکیده

1. The computational complexity of many problems means that optimal solutions are unlikely to be found in reasonable time in larger instances. 2. Problems may be ill-defined or data imprecise, so that an optimal solution based on estimated data will almost certainly not be optimal for the actual data. In such a situation it is preferable to obtain a robust solution that will be near-optimal over most scenarios. 3. The user may require several different solutions to make the final choice, particularly in situation where several criteria needed to be balanced using human judgement rather than technical measures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

متن کامل

Ensemble Clustering via Heuristic Optimisation

Jian Li A Thesis Submitted for the Degree of Doctor of Philosophy Brunel University II Ensemble Clustering via Heuristic Optimisation

متن کامل

Examining the Performance of Six Heuristic Optimisation Techniques in Different Forest Planning Problems

The existence of multiple decision-makers and goals, spatial and non-linear forest management objectives and the combinatorial nature of forest planning problems are reasons that support the use of heuristic optimisation algorithms in forest planning instead of the more traditional LP methods. A heuristic is a search algorithm that does not necessarily find the global optimum but it can produce...

متن کامل

Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling

An important issue in multi-objective optimisation is how to ensure that the obtained non-dominated set covers the Pareto front as widely as possible. A number of techniques (e.g. weight vectors, niching, clustering, cellular structures, etc.) have been proposed in the literature for this purpose. In this paper we propose a new approach to address this issue in multi-objective combinatorial opt...

متن کامل

Rule optimisation and theory optimisation: Heuristic search strategies for data driven machine learning

Previous implementations of the Aq algorithm have used rule optimisation search strategies to attempt to develop optimal classification procedures. These strategies involve generating successive characteristic descriptions each of which is individually of maximal value. This is contrasted with theory optimisation search strategies which, instead, generate successive complete classification proc...

متن کامل

Hyper-heuristics: an Emerging Direction in Modern Search Technology

This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide range of problem domains rather than cu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JORS

دوره 62  شماره 

صفحات  -

تاریخ انتشار 2011